Time Cost Analysis of a Consensus Algorithm ?
نویسنده
چکیده
This paper describes the time analysis of Chandra & Toueg's asynchronous consensus, an algorithm of major importance in the eld of fault-tolerant distributed computing. Contrary to other consensus protocols assuming semi-synchronous or synchronous conditions, Chandra & Toueg's algorithm considers an asynchronous system, thus requiring no bounds on communication delays nor on processes' speeds. Introducing an adversary model to describe the system's load, our analysis leads to the evaluation of an upper bound on the execution time of Chandra & Toueg's protocol. We compare our results concerning the asynchronous consensus with the results of former works dealing with semi-synchronous agreement algorithms. In a broader perspective, we consider this time analysis of Chandra & Toueg's consensus as a rst step towards the development of specialized tools for automatic time analysis and simulation of complex agreement protocols and services in distributed computing.
منابع مشابه
A New Heuristic Algorithm for Time-cost Trade-off Problem Taking into Account Monetary Value
Time-cost trade-off is one of the most important subjects in project management and of interest to contractors. The goal of time-cost trade-off is sensivity analysis of project costs to changes in activity duration in order to obtain the best combination of activity duration decrease, in a way that the sum of project costs is minimized. In the heuristics presented in this area, time crashing is...
متن کاملA New Heuristic Algorithm for Time-cost Trade-off Problem Taking into Account Monetary Value
Time-cost trade-off is one of the most important subjects in project management and of interest to contractors. The goal of time-cost trade-off is sensivity analysis of project costs to changes in activity duration in order to obtain the best combination of activity duration decrease, in a way that the sum of project costs is minimized. In the heuristics presented in this area, time crashing is...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کاملA particle swarm optimization algorithm for minimization analysis of cost-sensitive attack graphs
To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also,...
متن کاملANALYSIS AND DESIGN OF WATER DISTRIBUTION SYSTEMS VIA COLLIDING BODIES OPTIMIZATION
This paper describes the application of the recently developed metaheuristic algorithm for simultaneous analysis, design and optimization of Water Distribution Systems (WDSs). In this method, analysis is carried out using Colliding Bodies Optimization algorithm (CBO). The CBO is a population-based search approach that imitates nature’s ongoing search for better solutions. Also, design and cost ...
متن کاملIntegrated JIT Lot-Splitting Model with Setup Time Reduction for Different Delivery Policy using PSO Algorithm
This article develops an integrated JIT lot-splitting model for a single supplier and a single buyer. In this model we consider reduction of setup time, and the optimal lot size are obtained due to reduced setup time in the context of joint optimization for both buyer and supplier, under deterministic condition with a single product. Two cases are discussed: Single Delivery (SD) case, and Multi...
متن کامل